Discovery of IPv6 router interface addresses via heuristic methods

نویسندگان

  • Matthew D. Gray
  • Arthur Berger
چکیده

With the assignment of the last available blocks of public IPv4 addresses from Internet Assigned Numbers Authority, there is continued pressure for widespread IPv6 adoption. Because the IPv6 address space is orders of magnitude larger than the IPv4 address space, researchers need new methods and techniques to accurately measure and characterize growth in IPv6. This thesis focuses on IPv6 router infrastructure and examines the possibility of using heuristic methods in order to discover IPv6 router interfaces. We consider two heuristic techniques in an attempt to improve upon current state-of-the-art IPv6 router infrastructure discovery methods. The first heuristic examines the ability to generate candidate IPv6 addresses by finding the most common lower 64 bit patterns among IPv6 router interface address observed in historical probing data. The second heuristic generates candidate IPv6 addresses by assuming that an IPv6 address seen in historical probing data is one end of a point-to-point link, and uses the corresponding end’s IPv6 address. Using a distributed active topology measurement system, we test these heuristic methods on the IPv6 Internet. We find that our first heuristic is successful in discovering a non-trivial number of new router interfaces, while the second heuristic is more efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compact neighbor discovery

We present a stateless defense against the Neighbor Discovery Denial-of-Service (ND-DoS) attack in IPv6. The ND-DoS attack consists of remotely flooding a target subnet with bogus packets destined for random interface identifiers; a different one for each malicious packet. The 128-bit IPv6 address reserves its 64 low-order bits for the interface ID. Consequently, the malicious packets are very ...

متن کامل

UAv6: Alias Resolution in IPv6 Using Unused Addresses

As the IPv6 Internet grows, alias resolution in IPv6 becomes more important. Traditional IPv4 alias resolution techniques such as Ally do not work for IPv6 because of protocol differences. Recent techniques adopted specifically for IPv6 have shown promise, but utilize source routing, which has since been deprecated, or rely upon sequential fragment identifiers supported on only a third of route...

متن کامل

Performance Evaluation of Multicast for Small Conferences

Many new Internet applications require data transmission from a sender to multiple receivers. Unfortunately, the IP Multicast technology used today suffers from scalability problems, especially when used for small and sparse groups. Multicast for Small Conferences aims at providing more efficient support for example to audio conferences. In this work, we present a performance study of the conce...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014